Dynamic Point Labeling is Strongly PSPACE-Complete
نویسندگان
چکیده
An important but strongly NP-hard problem in automated cartography is how to best place textual labels for point features on a static map. We examine the complexity of various generalizations of this problem for dynamic and/or interactive maps. Specifically, we show that it is strongly PSPACE-complete to decide whether there is a smooth dynamic labeling (function from time to static labelings) when the points move, when points are added and removed, or when the user pans, rotates, and/or zooms their view of the points. In doing so we develop a framework from which a wide variety of labeling hardness results can be obtained, including (next to the PSPACE-hardness results) both known and new results on the NP-hardness of static labeling.
منابع مشابه
Solitaire Games ∗
The model-checking games associated with fixed-point logics are parity games, and it is currently not known whether the strategy problem for parity games can be solved in polynomial time. We study Solitaire-LFP, a fragment of least fixedpoint logic, whose evaluation games are nested soltaire games. This means that on each strongly connected component of the game, only one player can make nontri...
متن کاملComplexity of Concrete Type-Inference in the Presence of Exceptions
Concrete type-inference for statically typed object-oriented programming languages (e.g., Java, C ++) determines at each program point, those objects to which a reference may refer or a pointer may point during execution. A precise compile-time solution for this problem requires a ow-sensitive analysis. Our new complexity results for concrete type-inference distinguish the diiculty of the intra...
متن کاملA Dynamic Logic of Normative Systems
We propose a logical framework to represent and reason about agent interactions in normative systems. Our starting point is a dynamic logic of propositional assignments whose satisfiability problem is PSPACE-complete. We show that it embeds Coalition Logic of Propositional Control CL-PC and that various notions of ability and capability can be captured in it. We illustrate it on a water resourc...
متن کاملOn Simplex Pivoting Rules and Complexity Theory
We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm’s path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE. We conjecture that the same can be shown for most known variants of the simplex method. However, we also point out that Dantzig’s shadow vertex algorithm has a polyno...
متن کاملPrognosis of omega-Languages for the Diagnosis of *-Languages: A Topological Perspective
This article offers a novel perspective on the diagnosis of ∗-languages via a topological characterization of ω-languages. This allows for the different concepts that currently exist in diagnosis of discrete-event systems to be related to one another in a uniform setting and to study their complexity. For this purpose, we introduce the notion of prognosability of an ω-language, which in the cla...
متن کامل